Double-Critical Graphs and Complete Minors
نویسندگان
چکیده
A connected k-chromatic graph G is double-critical if for all edges uv of G the graph G − u − v is (k − 2)-colourable. The only known double-critical k-chromatic graph is the complete k-graph Kk. The conjecture that there are no other doublecritical graphs is a special case of a conjecture from 1966, due to Erdős and Lovász. The conjecture has been verified for k at most 5. We prove for k = 6 and k = 7 that any non-complete double-critical k-chromatic graph is 6-connected and contains a complete k-graph as a minor.
منابع مشابه
Complete and Almost Complete Minors in Double-Critical 8-Chromatic Graphs
A connected k-chromatic graph G is said to be double-critical if for all edges uv of G the graph G− u− v is (k− 2)-colourable. A longstanding conjecture of Erdős and Lovász states that the complete graphs are the only double-critical graphs. Kawarabayashi, Pedersen and Toft [Electron. J. Combin., 17(1): Research Paper 87, 2010] proved that every double-critical k-chromatic graph with k ≤ 7 cont...
متن کاملContributions to the Theory of Colourings, Graph Minors, and Independent Sets Second Edition
A connected k-chromatic graph G is double-critical if for all edges uv of G the graph G−u−v is (k−2)-colourable. The only known double-critical k-chromatic graph is the complete k-graph Kk. The conjecture that there are no other double-critical graphs is a special case of a conjecture from 1966, due to Erd®s and Lovász. The conjecture has been veri ed for k at most 5. We prove for k = 6 and k =...
متن کاملUnavoidable parallel minors of 4-connected graphs
A parallel minor is obtained from a graph by any sequence of edge contractions and parallel edge deletions. We prove that, for any positive integer k, every internally 4-connected graph of sufficiently high order contains a parallel minor isomorphic to a variation of K4,k with a complete graph on the vertices of degree k, the k-partition triple fan with a complete graph on the vertices of degre...
متن کاملForcing large complete minors in infinite graphs
It is well-known that in finite graphs, large complete minors/topological minors can be forced by assuming a large average degree. Our aim is to extend this fact to infinite graphs. For this, we generalise the notion of the relative end degree, which had been previously introduced by the first author for locally finite graphs, and show that large minimum relative degree at the ends and large mi...
متن کاملForcing Large Complete (Topological) Minors in Infinite Graphs
It is well known that in finite graphs, large complete minors/topological minors can be forced by assuming a large average degree. Our aim is to extend this fact to infinite graphs. For this, we generalize the notion of the relative end degree, which had been previously introduced by the first author for locally finite graphs, and show that large minimum relative degree at the ends and large mi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electr. J. Comb.
دوره 17 شماره
صفحات -
تاریخ انتشار 2010